Data-driven analysis on matching probability, routing distance and detour distance in ride-pooling services

نویسندگان

چکیده

By serving two or more passenger requests in each ride ride-sourcing markets, ride-pooling service is now becoming an important component of shared smart mobility. It generally expected to improve vehicle utilization rate, and therefore alleviate traffic congestion reduce carbon dioxide emissions. A few recent theoretical studies are conducted, mainly focusing on the equilibrium analysis markets with services impacts transit ridership congestion. In these studies, there three key measures that distinguish from non-pooling market analysis. The first proportion passengers who pool-matched(referred as pool-matching probability), second passengers’ average detour distance, third routing distance pick up drop off all different origins destinations one specific ride. These determined by demand for matching strategies. However, due complex nature ride-resourcing market, it difficult analytically determine relationships between demand. To fill this research gap, paper attempts empirically ascertain through extensive experiments based actual on-demand mobility data obtained Chengdu, Haikou, Manhattan. We surprised find (pool-matching probability, distance) number pool (which reflects demand) can be fitted some simple curves (with fairly high goodness-of-fit) exist elegant empirical laws relationships. Our findings insightful useful modeling applications such evaluation usage

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Securing Distance-vector Routing Protocols Securing Distance-vector Routing Protocols

The security requirements of distance-vector routing protocols are analyzed, their vulnerabilities identi ed, and countermeasures to these vulnerabilities are proposed. The innovation presented involves the use of mechanisms from the pathnding class of distancevector protocols as a solution to the security problems of distance-vector protocols. The result is the rst proposal to e ectively and e...

متن کامل

Fast Detour Computation for Ride Sharing

Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So finding a connection between big cities is quite easy. These places are on a list of designated origin and destination points. But when you want to go from a small town to another small town, even when they are next to a...

متن کامل

Distance Dependent Localization Approach in Oil Reservoir History Matching: A Comparative Study

To perform any economic management of a petroleum reservoir in real time, a predictable and/or updateable model of reservoir along with uncertainty estimation ability is required. One relatively recent method is a sequential Monte Carlo implementation of the Kalman filter: the Ensemble Kalman Filter (EnKF). The EnKF not only estimate uncertain parameters but also provide a recursive estimat...

متن کامل

On Bipartite Matching under the RMS Distance

Given two sets A and B of n points each in R, we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. We can compute an optimal matching in O(n2+δ) time, for any δ > 0, and an ε-approximation in time O((n/ε)3/2 log n). If the set B is allowed to move rigidly to minimize the rms distance, we can compute a rigid motion of B...

متن کامل

Ad-hoc On-Demand Distance Vector Routing

An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each Mobile Host operates as a specialized router, and routes are obtained as needed (i....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part C-emerging Technologies

سال: 2021

ISSN: ['1879-2359', '0968-090X']

DOI: https://doi.org/10.1016/j.trc.2020.102922